A Randomized Algorithm for Two Servers on the Line
نویسندگان
چکیده
منابع مشابه
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers in response to a sequence of requests. For 2 servers, it is known that the optimal deterministic algorithm has competitive ratio 2, and it has been a long-standing open problem whether it is possible to improve this ratio using randomization. We give a positive answer to this problem when the under...
متن کاملA Randomized Algorithm for Two Servers in Cross Polytope Spaces
It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Barta...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Optimal On-Line Algorithm for k-Servers on Trees
We investigate the k-server problem when the metric space is a tree. For this case we present an on-line k-competitive algorithm for k servers. The competitiveness ratio k is optimal. The algorithm is memoryless, in the sense that it does not use any information from the past.
متن کاملA randomized on-line algorithm for the k-server problem on a line
We give a O(n 2 3 logn)–competitive randomized k–server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k+o(k 3 2/ log k), this algorithm is o(k)–competitive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2809